package DemoReview;
import java.util.Scanner;

/**
 * 二维前缀和模板
 */

public class NowCoderDP35 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), m =
                in.nextInt(), q = in.nextInt();
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                arr[i][j] = in.nextInt();
        long[][] dp = new long[n + 1][m + 1];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
                        - dp[i - 1][j - 1] + arr[i - 1][j - 1];
            }
        }
        for (int i = 0; i < q; i++) {
            int a = in.nextInt(), b = in.nextInt();
            int c = in.nextInt(), d = in.nextInt();
            System.out.println(dp[c][d] + dp[a - 1][b - 1]
                    - dp[c][b - 1] - dp[a - 1][d]);
        }
    }
}
